The normal number of prime factors of fa(n)

نویسنده

  • FILIP SAIDAK
چکیده

Assuming a quasi-generalized Riemann Hypothesis (6) for certain Dedekind zeta functions, we prove the following theorem: If a ≥ 2 is a square-free integer, then for the exponent function f a (n) (defined below) we have n≤x (a,n)=1 (Ω(f a (n)) − 1 2 (log log n) 2) 2 ≪ x(log log x) 3. This implies that the function Ω(f a (n)) has " normal order " 1 2 (log log n) 2 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New characterization of some linear ‎groups‎

‎There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...

متن کامل

Normal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number

In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.

متن کامل

On Generalization of prime submodules

Let R be a commutative ring with identity and M be a unitary R-module. Let : S(M) −! S(M) [ {;} be a function, where S(M) is the set of submodules ofM. Suppose n 2 is a positive integer. A proper submodule P of M is called(n − 1, n) − -prime, if whenever a1, . . . , an−1 2 R and x 2 M and a1 . . . an−1x 2P(P), then there exists i 2 {1, . . . , n − 1} such that a1 . . . ai−1ai+1 . . . an−1x 2 P...

متن کامل

The lower bound for the number of 1-factors in generalized Petersen graphs

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

متن کامل

A Carlitz Module Analogue of a Conjecture of Erdős and Pomerance

Let A = Fq [T ] be the ring of polynomials over the finite field Fq and 0 = a ∈ A. Let C be the A-Carlitz module. For a monic polynomial m ∈ A, let C(A/mA) and ā be the reductions of C and a modulo mA respectively. Let fa(m) be the monic generator of the ideal {f ∈ A,Cf (ā) = 0̄} on C(A/mA). We denote by ω(fa(m)) the number of distinct monic irreducible factors of fa(m). If q = 2 or q = 2 and a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005